Skolem fragments
نویسنده
چکیده
W. V. Quine splits the fundamental question of ontology—What is there?—into two questions: What does a theory say that there is? and What theories ought we adopt? Of these, only the former seems amenable to philosophical treatment. Quine thus attempts to formulate an adequate criterion of ontological commitment. Syntactically, the initially existentially quantified sentences of a theory appear to constitute the locus of its ontological commitments (cf. [5], [2], [3], and [1]). Semantically, however, Quine offers at least three criteria of commitment: a theory is committed to (1) the objects in the domain of its intended model (cf. [4]); (2) the objects in the domain of its intended model that cannot be eliminated by means of proxy functions (cf. [6]); or (3) the objects in the domain of every model of it (or to objects of kinds such that some objects of those kinds are in each of its models) (cf. [7]). In this paper I shall show that Quine's syntactic criterion corresponds to and, indeed, follows from the third semantic criterion. Any philosopher using a syntactic criterion of ontological commitment such as Quine's that determines commitments according to sentences of the form
منابع مشابه
Skolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملHerbrand Theorems and Skolemization for Prenex Fuzzy Logics
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.
متن کاملFirst-order Multi-Modal Deduction1
We study prefixed tableaux for first-order multi-modal logic, providing proofs for soundness and completeness theorems, a Herbrand theorem on deductions describing the use of Herbrand or Skolem terms in place of parameters in proofs, and a lifting theorem describing the use of variables and constraints to describe instantiation. The general development applies uniformly across a range of regime...
متن کاملAnalytic Calculi for Monoidal T-norm Based Logic
Monoidal t-norm based logic MTL is the logic of left continuous t-norms. We introduce two analytic calculi for first-order MTL. These are obtained by lifting two sequent calculi for different fragments of this logic to the hypersequent level with subsequent addition of Avron’s communication rule. Our calculi enable to prove the mid(hyper)sequent theorem. As corollaries follow Herbrand’s theorem...
متن کاملNP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets of the form A = {1, . . . , n} are Skolem sets was solved by Thoralf Skolem [6] in 195...
متن کاملM ay 2 00 9 LINDSTRÖM THEOREMS FOR FRAGMENTS OF FIRST - ORDER LOGIC ∗
Lindström theorems characterize logics in terms of model-theoretic conditions such as Compactness and the Löwenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are fragments or extensions of fragments of first-order logic, e.g., k-variable logics and various modal logics. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 25 شماره
صفحات -
تاریخ انتشار 1984